Outerplanar Crossing Numbers of 3-Row Meshes, Halin Graphs and Complete p-Partite Graphs
نویسندگان
چکیده
An outerplanar (also called circular, convex, one-page) drawing of an n-vertex graph G is a drawing in which the vertices are placed on a circle and each edge is drawn using one straight-line segment. We derive exact results for the minimal number of crossings in any outerplanar drawings of the following classes of graphs: 3-row meshes, Halin graphs and complete p−partite graphs with equal size partite sets.
منابع مشابه
One- and two-page crossing numbers for some types of graphs
The simplest graph drawing method is that of putting the vertices of a graph on a line (spine) and drawing the edges as half-circles on k half planes (pages). Such drawings are called k-page book drawings and the minimal number of edge crossings in such a drawing is called the k-page crossing number. In a one-page book drawing, all edges are placed on one side of the spine, and in a two-page bo...
متن کاملA Hopfield Neural Network Model for the Outerplanar Drawing Problem
In the outerplanar (other alternate concepts are circular or one-page) drawing, one places vertices of a n−vertex m−edge connected graph G along a circle, and the edges are drawn as straight lines. The minimal number of crossings over all outerplanar drawings of the graph G is called the outerplanar (circular, convex, or one-page) crossing number of the graph G. To find a drawing achieving the ...
متن کاملAlgorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs
We show that there exist linear-time algorithms that compute the strong chromatic index of Halin graphs, of maximal outerplanar graphs and of distance-hereditary graphs.
متن کاملSome Algebraic and Combinatorial Properties of the Complete $T$-Partite Graphs
In this paper, we characterize the shellable complete $t$-partite graphs. We also show for these types of graphs the concepts vertex decomposable, shellable and sequentially Cohen-Macaulay are equivalent. Furthermore, we give a combinatorial condition for the Cohen-Macaulay complete $t$-partite graphs.
متن کاملPlanar Lombardi Drawings of Outerpaths
A Lombardi drawing of a graph is a drawing where edges are represented by circular arcs that meet at each vertex v with perfect angular resolution 360◦/deg(v) [3]. It is known that Lombardi drawings do not always exist, and in particular, that planar Lombardi drawings of planar graphs do not always exist [1], even when the embedding is not fixed. Existence of planar Lombardi drawings is known f...
متن کامل